Cohomological dimension of certain algebraic varieties
نویسندگان
چکیده
منابع مشابه
Algorithmic Computation of Local Cohomology Modules and the Cohomological Dimension of Algebraic Varieties
In this paper we present algorithms that compute certain local cohomology modules associated to a ring of polynomials containing the rational numbers. In particular we are able to compute the local cohomological dimension of algebraic varieties in characteristic zero.
متن کاملOn Certain Cohomological Invariants of Algebraic Number Fields
We see the Poincaré series from a cohomological point of view and apply the idea to a finite group G acting on any commutative ring R with unity. For a 1cocycle c of G on the unit group R×, we define a |G|-torsion module Mc/Pc, which is independent of the choice of representatives of the cohomology class γ = [c]. We are mostly interested in determining Mc/Pc where G is the Galois group of a fin...
متن کاملCombinatorial Dimension Theory of Algebraic Varieties
How can one compute the dimension of a projective algebraic subset, given by a system of equations? There are different definitions, and their equivalence is part of the classical dimension theory in algebraic geometry. The game is then the following: to make some definition of dimension effective enough to get an algorithm. A first method consists to think algebraically and to use the Hilbert ...
متن کاملCohomological Dimension of Markov Compacta
We rephrase Gromov’s definition of Markov compacta, introduce a subclass of Markov compacta defined by one building block and study cohomological dimensions of these compacta. We show that for a Markov compactum X, dimZ(p) X = dimQ X for all but finitely many primes p where Z(p) is the localization of Z at p. We construct Markov compacta of arbitrarily large dimension having dimQ X = 1 as well ...
متن کاملRandomized and Deterministic Algorithms for the Dimension of Algebraic Varieties
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale model of computation over C , that it admits a s O(1) D O(n) deterministic algorithm, and that for systems with integer coeecients it is in the Arthur-Merlin class under the Generalized Rie-mann Hypothesis. The rst two r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2002
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-02-06500-0